The complexity of irredundant sets parameterized by size
نویسندگان
چکیده
منابع مشابه
The complexity of irredundant sets parameterized by size
An irredundant set of vertices V ′ ⊆ V in a graph G = (V,E) has the property that for every vertex u ∈ V ′, N(V ′ − {u}) is a proper subset of N(V ′). We investigate the parameterized complexity of determining whether a graph has an irredundant set of size k, where k is the parameter. The interest of this problem is that while most “k-element vertex set” problems are NP-complete, several are kn...
متن کاملParameterized Complexity of Secure Sets
Secure sets were introduced by Brigham, Dutton, and Hedetniemi [1] as an extension of defensive alliances in a graph. Members of a defensive alliance have agreed to come to the aid of their neighbors in the alliance for mutual protection from attack by nonmembers. Alliances can occur, for example, between nations, biological sequences, and business cartels, and also have been used to model a va...
متن کاملIrredundant Sets in Boolean Algebras
It is shown that every uncountable Boolean algebra A contains an uncountable subset / such that no a of / is in the subalgebra generated by I\{a} using an additional axiom of set theory. It is also shown that a use of some such axiom is necessary. A subset / of a Boolean algebra A is irredundant if no proper subset of / generates the same subalgebra as /, or equivalently, if no a of / is in the...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولIrredundant Generating Sets of Finite Nilpotent Groups
It is a standard fact of linear algebra that all bases of a vector space have the same cardinality, namely the dimension of the vector space over its base field. If we treat a vector space as an additive abelian group, then this is equivalent to saying that an irredundant generating set for a vector space must have cardinality equal to the dimension of the vector space. The same is not true for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00185-7